On circumscribing polygons for line segments
نویسندگان
چکیده
منابع مشابه
Hamiltonian Triangulations and Circumscribing Polygons
Let Σ = { S1 , . . . , Sn } be a finite set of disjoint line segments in the plane. We conjecture that its visibility graph, Vis(Σ), is hamiltonian. In fact, we make the stronger conjecture that Vis(Σ) has a hamiltonian cycle whose embedded version is a simple polygon (i.e., its boundary edges are non-crossing visibility segments). We call such a simple polygon a spanning polygon of Σ. Existenc...
متن کاملWeak Visibility Queries of Line Segments in Simple Polygons
Given a simple polygon P in the plane, we present new algorithms and data structures for computing the weak visibility polygon from any query line segment in P . We build a data structure in O(n) time and O(n) space that can compute the visibility polygon for any query line segment s in O(k log n) time, where k is the size of the visibility polygon of s and n is the number of vertices of P . Al...
متن کاملOn Indexing Line Segments
In several image applications, it is necessary to retrieve specific line segments born a potentially very large set. In this paper, we consider the problem of indexing straight line segments to enable efficient retrieval of all line segments that (i) go through a specified point, or (ii) intersect a specified line segment. We propose a data organization, based on the Hough transform, that can b...
متن کاملOn-Line Searching in Simple Polygons
In this paper we study the problem of a robot searching for a visually recognizable target in an unknown simple polygon. We present two algorithms. Both work for arbitrarily oriented polygons. The search cost is proportional to the distance traveled by the robot. We use competitive analysis to judge the performance of our strategies. The rst one is a simple modiication of Djikstra's shortest pa...
متن کاملWeak visibility queries of line segments in simple polygons and polygonal domains
In this paper we consider the problem of computing the weak visibility polygon of any query line segment pq (or WVP(pq)) inside a given polygon P . Our first non-trivial algorithm runs in simple polygons and needs O(n log n) time and O(n) space in the preprocessing phase to report WVP(pq) of any query line segment pq in time O(log n + |WVP(pq)|). We also give an algorithm to compute the weak vi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1998
ISSN: 0925-7721
DOI: 10.1016/s0925-7721(97)00023-0